منابع مشابه
The Implications of Paraconsistency
This is a connected scries of arguments concerning paraconsistent logic. It is argued first that paraconsistency is an option worth pursuing in automated reasoning, then that the most popular paraconsistent logic, fde, is inadequate for the reconstruction of essential first order arguments. After a case is made for regarding quantifiers as dyadic rather than monadic operators, it is shown that ...
متن کاملAnti-intuitionism and paraconsistency
This paper aims to help to elucidate some questions on the duality between the intuitionistic and the paraconsistent paradigms of thought, proposing some new classes of anti-intuitionistic propositional logics and investigating their relationships with the original intuitionistic logics. It is shown here that anti-intuitionistic logics are paraconsistent, and in particular we develop a first an...
متن کاملParaconsistency Everywhere
Paraconsistent logics are, by definition, inconsistency tolerant: In a paraconsistent logic, inconsistencies need not entail everything. However, there is more than one way a body of information can be inconsistent. In this paper I distinguish contradictions from other inconsistencies, and I show that many different logics are in an important sense, “paraconsistent” in virtue of being inconsist...
متن کاملBilattices and Paraconsistency
Bilattices are algebraic structures that were introduced by Ginsberg, and further examined by Fitting, as a general framework for many applications in computer science. In this paper we consider their applicability for computerized reasoning in general, and for reasoning with inconsistent data in particular. 1 Background A great deal of research has been devoted in the last twenty years for con...
متن کاملParaconsistency of Interactive Computation
The goal of computational logic is to allow us to model computation as well as to reason about it. We argue that a computational logic must be able to model interactive computation. We show that firstorder logic cannot model interactive computation due to the incompleteness of interaction. We show that interactive computation is necessarily paraconsistent, able to model both a fact and its nega...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Logic and Logical Philosophy
سال: 2004
ISSN: 2300-9802,1425-3305
DOI: 10.12775/llp.2000.005